Exponential and Infinitary Divisors
نویسندگان
چکیده
منابع مشابه
On certain arithmetic functions involving exponential divisors
The integer d is called an exponential divisor of n = ∏r i=1 p ai i > 1 if d = ∏r i=1 p ci i , where ci|ai for every 1 ≤ i ≤ r. The integers n = ∏r i=1 p ai i ,m = ∏r i=1 p bi i > 1 having the same prime factors are called exponentially coprime if (ai, bi) = 1 for every 1 ≤ i ≤ r. In this paper we investigate asymptotic properties of certain arithmetic functions involving exponential divisors a...
متن کاملConcerning Some Arithmetic Functions Which Use Exponential Divisors
Let σ(e)(n) denote the sum of the exponential divisors of n, τ (e)(n) denote the number of the exponential divisors of n, σ(e)∗(n) denote the sum of the e-unitary divisors of n and τ (e)∗(n) denote the number of the e-unitary divisors of n. The aim of this paper is to present several inequalities about the arithmetic functions which use exponential divisors. Among these inequalities, we have th...
متن کاملExponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Parity games form an intriguing family of infinitary payoff games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of mean and discounted payoff games, which in turn are very natural subclasses of turn-based stochastic payoff games. From a theoretical point of view, solving these games is one...
متن کاملCoinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic
We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform way. We define ∞ =, the infinitary extension of a given equational theory =R, and →∞, the standard notion of infinitary rewriting associated to a reduction relation →R, as follows: ∞ = := νR. (=R ∪ R) → := μR. νS. (→R ∪ R) ; S Here μ and ν are the leas...
متن کاملCategoricity and Infinitary Logics
We point out a gap in Shelah’s proof of the following result: Claim 0.1. Let K be an abstract elementary class categorical in unboundedly many cardinals. Then there exists a cardinal λ such that whenever M,N ∈ K have size at least λ, M ≤ N if and only if M L∞,LS(K)+ N . The importance of the claim lies in the following theorem, implicit in Shelah’s work: Theorem 0.2. Assume the claim. Let K be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Mathematical Journal
سال: 2017
ISSN: 0041-5995,1573-9376
DOI: 10.1007/s11253-017-1289-7